پیدا کردن یک نقطه درونی نسبی یک چند‌وجهی با استفاده از برنامه‌ریزی خطی: کاربرد در برنامه‌ریزی هندسی

One of the fundamental concepts in convex analysis and optimization is the relative interior of a set. This concept is used when the interior of a set is empty due to the incompleteness of its dimension. In this paper, first, we propose a linear programming model to find a relative interior point of a polyhedral set. Then, we discuss the application of this model to geometric programming. Specifically, we show that a special form of our proposed model can determine the degeneracy of a geometric programming problem by identifying a relative interior point of the feasible region of its dual. Finally, we present two numerical examples for describing the applications of the proposed model.